Ciphertext indistinguishability - PDFSEARCH.IO - Document Search Engine

Ciphertext indistinguishability
Results: 264

#	Item
231	Witness Encryption from Instance Independent Assumptions Craig Gentry IBM Research, T.J. Watson [removed] Allison Bishop Lewko Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2014-04-30 01:07:28 Semantic security XTR ID-based encryption Security Applied mathematics Cramer–Shoup cryptosystem Cryptography Ciphertext indistinguishability Cyberwarfare
232	Towards a Unified Theory of Cryptographic Agents Shashank Agrawal ∗ Shweta Agrawal Add to Reading List Source URL: cryptome.org Language: English - Date: 2014-06-23 06:42:41 Homomorphic encryption Database schema Public-key cryptography Random oracle ID-based encryption Cryptography Ciphertext indistinguishability Obfuscation
233	SECURITY AND COMMUNICATION NETWORKS Security Comm. Networks[removed]Published online in Wiley Online Library (wileyonlinelibrary.com). DOI: [removed]sec.274 RESEARCH ARTICLE Add to Reading List Source URL: bbcr.uwaterloo.ca Language: English - Date: 2011-07-16 17:53:26 Ciphertext indistinguishability McEliece cryptosystem Adaptive chosen-ciphertext attack Semantic security Optimal asymmetric encryption padding Probabilistic encryption Post-quantum cryptography RSA Paillier cryptosystem Cryptography Public-key cryptography Niederreiter cryptosystem
234	Multi-Bit Cryptosystems based on Lattice Problems Akinori Kawachi∗ Keisuke Tanaka∗ Keita Xagawa∗ Abstract We propose multi-bit versions of several single-bit cryptosystems based on lattice problems, the error-free Add to Reading List Source URL: xagawa.net Language: English - Date: 2010-01-23 11:51:00 Mathematics Applied mathematics RSA Lattice problem Ciphertext indistinguishability Ciphertext Mathematical sciences Rabin cryptosystem Blum–Goldwasser cryptosystem Cryptography Public-key cryptography Electronic commerce
235	A Survey of Homomorphic Encryption for Nonspecialists Add to Reading List Source URL: downloads.hindawi.com Language: English - Date: 2012-02-01 11:05:22 Homomorphic encryption Paillier cryptosystem Malleability ElGamal encryption Probabilistic encryption Goldwasser–Micali cryptosystem Ciphertext indistinguishability Semantic security Cramer–Shoup cryptosystem Cryptography Public-key cryptography Electronic commerce
236	Lattice Cryptography for the Internet Chris Peikert∗ February 17, 2014 Abstract In recent years, lattice-based cryptography has been recognized for its many attractive properties, such Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2014-02-18 17:10:47 Homomorphic encryption XTR One-time pad Key encapsulation Cryptography Ciphertext indistinguishability Learning with errors
237	Modular Code-Based Cryptographic Verification Cédric Fournet Markulf Kohlweiss Pierre-Yves Strub Add to Reading List Source URL: research.microsoft.com Language: English - Date: 2011-08-23 11:52:17 Public-key cryptography Electronic commerce Advantage XTR Dolev-Yao model RSA CMAC Ciphertext indistinguishability Universal composability Cryptography Cryptographic protocols Finite fields
238	CS255: Cryptography and Computer Security Winter 2013 Final Exam Instructions: Add to Reading List Source URL: crypto.stanford.edu Language: English - Date: 2014-02-13 00:34:50 Deterministic encryption RSA Cipher One-time pad Encryption Authenticated encryption Ciphertext indistinguishability Cramer–Shoup cryptosystem Cryptography Semantic security Ciphertext stealing
239	CS255: Introduction to Cryptography Winter 2014 Assignment #1: Solutions Answer 0. Let m0 be the message “attack at dawn”, m1 be the message “attack at dusk”, and c0 , c1 be Add to Reading List Source URL: crypto.stanford.edu Language: English - Date: 2014-02-26 12:43:20 Initialization vector One-time pad Ciphertext indistinguishability Cryptography Advantage Binary tree
240	CS255: Introduction to Cryptography Winter 2014 Assignment #2: Solutions Answer 1. (a) Suppose we can find two message/hash pairs hM1 , h(M1 )i and hM2 , h(M2 )i such that Add to Reading List Source URL: crypto.stanford.edu Language: English - Date: 2014-03-15 12:14:59 Semantic security Advantage Diffie–Hellman problem XTR Diffie–Hellman key exchange Ciphertext indistinguishability Cryptography Finite fields Cryptographic protocols